package com.placedial;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;
import java.util.Map.Entry;

public class GraphP {
	
	private Set vertexset;
	private Set coverSet;
	private int k;
	private int size;
	private HashMap graph;
	
	public GraphP(Set vertexset, Set coverSet, int k, int size, HashMap graph) {
		super();
		this.vertexset = vertexset;
		this.coverSet = coverSet;
		this.k = k;
		this.size = size;
		this.graph = graph;
	}
	public Set getCoverSet() {
		return coverSet;
	}
	public void setCoverSet(Set coverSet) {
		this.coverSet = coverSet;
	}
	public HashMap getGraph() {
		return graph;
	}
	public void setGraph(HashMap graph) {
		this.graph = graph;
	}
	public int getK() {
		return k;
	}
	public void setK(int k) {
		this.k = k;
	}
	public int getSize() {
		return size;
	}
	public void setSize(int size) {
		this.size = size;
	}
	public Set getVertexset() {
		return vertexset;
	}
	public void setVertexset(Set vertexset) {
		this.vertexset = vertexset;
	}
	
	
	

}
